Learning Java Functional Programming by Richard M Reese

Author:Richard M Reese [Reese, Richard M]
Language: eng
Format: azw3
Publisher: Packt Publishing
Published: 2015-10-14T04:00:00+00:00

Preorder, inorder, and postorder are techniques for traversing a binary tree. They are similar in nature consisting of three basic operations. They differ in the order they are followed as shown in the following table. Going left or right means to traverse the left or right subtree, respectively. To visit a node is to perform some operation on the node:

Technique

Steps

Preorder

Visit the node

Go left

Go right

Inorder

Go left

Visit the node

Go right

Postorder

Go left

Go right

Visit the node

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.